Constraint Programming to Solve Maximal Density Still Life
نویسندگان
چکیده
The Maximum Density Still Life problem fills a finite Game of Life board with a stable pattern of cells that has as many live cells as possible. Although simple to state, this problem is computationally challenging for any but the smallest sizes of board. Especially difficult is to prove that the maximum number of live cells has been found. Various approaches have been employed. The most successful are approaches based on Constraint Programming (CP). We describe the Maximum Density Still Life problem, introduce the concept of constraint programming, give an overview on how the problem can be modelled and solved with CP, and report on best-known results for the problem.
منابع مشابه
Dynamic Symmetry Breaking in Constraint Programming and Linear Programming Hybrids: Still Life as a Case Study
The efficient solving of many CSPs has been achieved by hybrid methods that combine Constraint Programming (CP) and Linear Programming (LP). One such case is the ‘Maximum Density Still Life’ problem. An obstacle to overcome in order to solve this problem efficiently is the inherent symmetry. Symmetry in Constraint Satisfaction Problems (CSPs) can lead to redundant search, since subtrees may be ...
متن کاملIncorporating Return on Inventory Investment into Joint Lot-Sizing and Price Discriminating Decisions: A Fuzzy Chance Constraint Programming Model
Coordination of market decisions with other aspects of operations management such as production and inventory decisions has long been a meticulous research issue in supply chain management. Generally, changes to the original lot-sizing policy stimulated by market prices may impose remarkable deviation revenue throughout the supply and demand chain system. This paper examines how to set the chan...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملMathematical Model for Bi-objective Maximal Hub Covering Problem with Periodic Variations of Parameters
The problem of maximal hub covering as a challenging problem in operation research. Transportation programming seeks to find an optimal location of a set of hubs to reach maximum flow in a network. Since the main structure's parameters of the problem such as origin-destination flows, costs and travel time, change periodically in the real world applications, new issues arise in handling it. In t...
متن کاملMulti-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method
This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010